package mylib.archive.y2012.m08.SNSS_R4;

import mylib.dir.FastInputReader;

import java.io.PrintWriter;
import java.math.BigInteger;

public class TaskB {
    BigInteger[] f;

    {
        f = new BigInteger[20000];
        f[0] = BigInteger.ONE;
        f[1] = BigInteger.valueOf(2);
        for (int i = 2; i < f.length; ++i)
            f[i] = f[i - 1].add(f[i - 2]);
    }

    public void solve(int testNumber, FastInputReader in, PrintWriter out) {
        out.println(toFib(parse(in.nextString()).add(parse(in.nextString()))));
    }

    private String toFib(BigInteger a) {
        boolean add = false;
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = f.length - 1; i >= 0; --i) {
            if (f[i].compareTo(a) <= 0) {
                add = true;
                stringBuilder.append('1');
                a = a.subtract(f[i]);
            } else if (add)
                stringBuilder.append('0');
        }
        return stringBuilder.toString();
    }

    private BigInteger parse(String s) {
        BigInteger res = BigInteger.ZERO;
        for (int i = 0; i < s.length(); ++i) {
            if (s.charAt(s.length() - i - 1) == '1')
                res = res.add(f[i]);
        }
        return res;
    }
}
